An analytic disproof of Robertson's Conjecture
نویسندگان
چکیده
منابع مشابه
Disproof of an admissibility conjecture of Weiss
Two conjectures on admissible control operators by George Weiss are disproved in this paper. One conjecture says that an operator B defined on an infinite-dimensional Hilbert space U is an admissible control operator if for every element u ∈ U the vector Bu defines an admissible control operator. The other conjecture says that B is an admissible control operator if a certain resolvent condition...
متن کاملDisproof of the Mertens Conjecture
The Mertens conjecture states that M(x) < x ⁄2 for all x > 1, where M(x) = n ≤ x Σ μ(n) , and μ(n) is the Mo bius function. This conjecture has attracted a substantial amount of interest in its almost 100 years of existence because its truth was known to imply the truth of the Riemann hypothesis. This paper disproves the Mertens conjecture by showing that x → ∞ lim sup M(x) x − ⁄2 > 1. 06 ....
متن کاملDisproof of a conjecture of Jacobsthal
For any integer n ≥ 1, let j(n) denote the Jacobsthal function, and ω(n) the number of distinct prime divisors of n. In 1962 Jacobsthal conjectured that for any integer r ≥ 1, the maximal value of j(n) when n varies over N with ω(n) = r is attained when n is the product of the first r primes. We show that this is true for r ≤ 23 and fails at r = 24, thus disproving Jacobsthal’s conjecture.
متن کاملDisproof of a Conjecture of Neumann-Lara
We disprove the following conjecture due to Vı́ctor Neumann-Lara: for every pair (r, s) of integers such that r > s > 2, there is an infinite set of circulant tournaments T such that the dichromatic number and the cyclic triangle free disconnection of T are equal to r and s, respectively. Let Fr,s denote the set of circulant tournaments T with dc(T ) = r and − →ω 3 (T ) = s. We show that for eve...
متن کاملDisproof of the List Hadwiger Conjecture
The List Hadwiger Conjecture asserts that every Kt-minor-free graph is tchoosable. We disprove this conjecture by constructing a K3t+2-minor-free graph that is not 4t-choosable for every integer t ≥ 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1991
ISSN: 0022-247X
DOI: 10.1016/0022-247x(91)90071-7